Data compression with $\Sigma\Pi$-approximations based on splines
نویسندگان
چکیده
منابع مشابه
Multiresolution Decomposition Based Data Compression with B - Splines
A new multiresolution decomposition scheme based on constrained B-Spline decimation/interpolation is proposed. The proposed decomposition algorithm is tested on greyscale and color image compression, and the results are compared with DCT based compression. Dithering and postprocessing are applied to the compressed images to deal with artifacts at low bit rate compression.
متن کاملRadial basis function approximations as smoothing splines
Radial basis function methods for interpolation can be interpreted as roughness-minimizing splines. Although this relationship has already been established for radial basis functions of the form g(r) = r and g(r) = r log(r), it is extended here to include a much larger class of functions. This class includes the multiquadric g(r) = (r 2 + c 2) 1=2 and inverse multiquadric g(r) = (r 2 + c 2) ?1=...
متن کاملData Representation and Compression Using Linear-Programming Approximations
We propose ‘Dracula’, a new framework for unsupervised feature selection from sequential data such as text. Dracula learns a dictionary of n-grams that efficiently compresses a given corpus and recursively compresses its own dictionary; in effect, Dracula is a ‘deep’ extension of Compressive Feature Learning. It requires solving a binary linear program that may be relaxed to a linear program. B...
متن کاملOn Image Compression by Biorthogonal Wavelet Transforms Based on Discrete Splines
We present a new family of biorthogonal wavelet transforms and a related library of biorthogonal symmetric wavelets. We employed the interpolatory continuous and discrete splines as a tool for devising a discrete biorthogonal wavelet scheme. The construction is based on the \lifting scheme" presented by Sweldens in [1]. The lifting scheme allows custom design and fast implementation of the tran...
متن کاملEffective Steganography Detection Based On Data Compression
(The main idea: The compression used for stegotext detection. It is known that an embedding message breaks statistical structure of the container, increasing its entropy. Consequently, the full container will compress worse than empty. Let us consider the example: A, B empty and full container respectively. Table 1: Container size before and after compression container.. container size before c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applications of Mathematics
سال: 1993
ISSN: 0862-7940,1572-9109
DOI: 10.21136/am.1993.104563